Grassmann algebras for proving a theorem on Pfaffians

On Theorem-Proving in Horn Theories with Built-in Algebras

We present a semi-decision procedure to prove ground theorems in Horn theories with built-in algebras. This is a maximal-unit-strategy based method, i.e in all our inference rules at least one of the premises clauses is an unit one. As in 4], constraint formalism is used as well ; but more general speciications are studied. To limit the search space, an rpo-like ordering is used. Neither uniica...

Theorem Proving for Verification

The challenges in using theorem proving for verification of parallel systems are to achieve adequate automation, and to allow human guidance to be expressed in terms of the system under examination rather than the mechanisms of the prover. This paper provides an overview of techniques that address these challenges.

Theorem Proving for the

This paper discusses the challenges of adding symbolic computation capabilities to a computer algebra system. Indeed, a simple expressions such as m × n can be evaluated to a full value when both m and n have known values. However, if one or both of them have no definite value, then most CASs treat them as symbols and a syntactic representation of some kind is returned. Most CASs do this withou...

On Theorem Proving in Annotated

A Note on Interactive Theorem Proving with Theorem Continuation Functions

A simple technique for using theorem continuation functions interactively with HOL's sub-goal package is presented. An interesting aspect of the technique is that it hinges on the existence of assignable variables in ML. Suppose we wish to prove a /\ b ==> b /\ a using HOL's subgoal package 1]: 1 #g "a /\ b ==> b /\ a" ;; "a /\ b ==> b /\ a" The natural proof is to assume the antecedent a /\ b ...